منابع مشابه
Invariants of Formal Group Law Actions
0. Introduction. In this note, k denotes a field of characteristic p > 0, and the letters T, X and Y are formal indeterminants. Let F: k[[T]] —• /c[[X,Y]] be a (fixed) one-dimensional formal group law [Dieudonné, Hazewinkel, Lazard, Lubin] of height h > 0. Let V denote a k[[T]] module of finite length. Suppose Ann(V) = (T). Let q = p denote the least power of p such that n < q. It follows that ...
متن کاملThe symplectic vortex equations and invariants of Hamiltonian group actions
In this paper we define invariants of Hamiltonian group actions for central regular values of the moment map. The key hypotheses are that the moment map is proper and that the ambient manifold is symplectically aspherical. The invariants are based on the symplectic vortex equations. Applications include an existence theorem for relative periodic orbits, a computation for circle actions on a com...
متن کاملSeparating Invariants for Arbitrary Linear Actions of the Additive Group
We consider an arbitrary representation of the additive group Ga over a field of characteristic zero and give an explicit description of a finite separating set in the corresponding ring of invariants.
متن کاملInvariants of Algebraic Group Actions in Arbitrary Characteristic
Let G be an affine algebraic group acting on an affine variety X. We present an algorithm for computing generators of the invariant ring K[X] in the case where G is reductive. Furthermore, we address the case where G is connected and unipotent, so the invariant ring need not be finitely generated. For this case, we develop an algorithm which computes K[X] in terms of a so-called colon-operation...
متن کاملComputing Invariants of Algebraic Group Actions in Arbitrary Characteristic
Let G be an affine algebraic group acting on an affine variety X. We present an algorithm for computing generators of the invariant ring K[X] in the case where G is reductive. Furthermore, we address the case where G is connected and unipotent, so the invariant ring need not be finitely generated. For this case, we develop an algorithm which computes K[X] in terms of a so-called colon-operation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the American Mathematical Society
سال: 1983
ISSN: 0273-0979
DOI: 10.1090/s0273-0979-1983-15193-5